On Expressiveness and Complexity in Real-Time Model Checking

نویسندگان

  • Patricia Bouyer
  • Nicolas Markey
  • Joël Ouaknine
  • James Worrell
چکیده

Metric Interval Temporal Logic (MITL) is a popular formalism for expressing real-time specifications. This logic achieves decidability by restricting the precision of timing constraints, in particular, by banning so-called punctual specifications. In this paper we introduce a significantly more expressive logic that can express a wide variety of punctual specifications, but whose model-checking problem has the same complexity as that of MITL. We conclude that for model checking the most commonly occurring specifications, such as invariance and bounded response, punctuality can be accommodated at no cost.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantified CTL: expressiveness and model checking

While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we study its expressiveness (showing in particular that QCTL coincides with Monadic Second-Order Logic for both semantics)...

متن کامل

Quantified CTL : expressiveness and model checking ( Extended abstract ) Arnaud

While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we study its expressiveness (showing in particular that QCTL coincides with Monadic Second-Order Logic for both semantics)...

متن کامل

Quantified CTL: Expressiveness and Complexity

While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we study its expressiveness (showing in particular that QCTL coincides with Monadic Second-Order Logic for both semantics)...

متن کامل

Computation Tree Logic Model Checking Based on Possibility Measures

In order to deal with the systematic verification with uncertain infromation in possibility theory, Li and Li [19] introduced model checking of linear-time properties in which the uncertainty is modeled by possibility measures. Xue, Lei and Li [26] defined computation tree logic (CTL) based on possibility measures, which is called possibilistic CTL (PoCTL). This paper is a continuation of the a...

متن کامل

Symbolic Model Checking for Real-time Systems

We describe nite-state programs over real-numbered time in a guardedcommand language with real-valued clocks or, equivalently, as nite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time speci cation (given in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008